A Note on the Ross-Taylor Theorem
نویسنده
چکیده
In this note the conditions used in proving a result due to S. M. Ross and H. M. Taylor are examined. These results pertain to the existence of bounded solutions to the average cost optimality equation for controlled Markov processes with an average cost criterion. In particular, we show how the use of commonly found convexity (concavity) properties of value functions can be employed to verify a seemingly rather restrictive equicontinuity condition. In addition, we remark that several results in the literature can be viewed as special cases of the result by Ross and Taylor, contrary to claims otherwise.
منابع مشابه
Presentation and Solving Non-Linear Quad-Level Programming Problem Utilizing a Heuristic Approach Based on Taylor Theorem
The multi-level programming problems are attractive for many researchers because of their application in several areas such as economic, traffic, finance, management, transportation, information technology, engineering and so on. It has been proven that even the general bi-level programming problem is an NP-hard problem, so the multi-level problems are practical and complicated problems therefo...
متن کاملState Estimation of MEMs Capacitor Using Taylor Expansion
This paper deals with state estimation of micro tunable capacitor subjected to nonlinear electrostatic force. For this end a nonlinear observer has been designed for state estimation of the structure. Necessary and sufficient conditions for construction of the observer are presented. Stability of the observer is checked using Lyapunov theorem. Observer design is based on converting of differen...
متن کاملA note on spectral mapping theorem
This paper aims to present the well-known spectral mapping theorem for multi-variable functions.
متن کاملA Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei
In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...
متن کاملA Note on the Strong Law of Large Numbers
Petrov (1996) proved the connection between general moment conditions and the applicability of the strong law of large numbers to a sequence of pairwise independent and identically distributed random variables. This note examines this connection to a sequence of pairwise negative quadrant dependent (NQD) and identically distributed random variables. As a consequence of the main theorem ...
متن کامل